Test Series - Data Structure

3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

Test Number 54/115

Q: Select the code snippet which performs in-order traversal.
A. public void inorder(Tree root) { System.out.println(root.data); inorder(root.left); inorder(root.right); }
B. public void inorder(Tree root) { inorder(root.left); System.out.println(root.data); inorder(root.right); }
C. public void inorder(Tree root) { System.out.println(root.data); inorder(root.right); inorder(root.left); }
D. public void inorder(Tree root) { inorder(root.right); inorder(root.left); System.out.println(root.data); }
Solution: In-order traversal follows LNR(Left-Node-Right).
Q: Select the code snippet which performs level-order traversal.
A. public static void levelOrder(Tree root) { Queue queue=new LinkedList(); queue.add(root); while(!queue.isEmpty()) { Node tempNode=queue.poll(); System.out.println("%d ",tempNode.data); if(tempNode.left!=null) queue.add(tempNode.left); if(tempNode.right!=null) queue.add(tempNode.right); } }
B. public static void levelOrder(Tree root) { Queue queue=new LinkedList(); queue.add(root); while(!queue.isEmpty()) { Node tempNode=queue.poll(); System.out.println("%d ",tempNode.data); if(tempNode.left!=null) queue.add(tempNode.right); if(tempNode.right!=null) queue.add(tempNode.left); } }
C. public static void levelOrder(Tree root) { Queue queue=new LinkedList(); queue.add(root); while(!queue.isEmpty()) { Node tempNode=queue.poll(); System.out.println("%d ",tempNode.data); if(tempNode.right!=null) queue.add(tempNode.left); if(tempNode.left!=null) queue.add(tempNode.right); } }
D. public static void levelOrder(Tree root) { Queue queue=new LinkedList(); queue.add(root); while(!queue.isEmpty()) { Node tempNode=queue.poll(); System.out.println("%d ",tempNode.data); if(tempNode.right!=null) queue.add(tempNode.left.left); if(tempNode.left!=null) queue.add(tempNode.right.right); } }
Solution: Firstly add the root node to the queue. Then for all the remaining nodes, pop the front end of the queue and print it, add the left and right children of the popped node to the queue.
Q: What is the space complexity of the in-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
A. O(1)
B. O(nlogd)
C. O(logd)
D. O(d)
Solution: In the worst case we have d stack frames in the recursive call, hence the complexity is O(d).
Q: What is the time complexity of level order traversal?
A. O(1)
B. O(n)
C. O(logn)
D. O(nlogn)
Solution: Since you have to go through all the nodes, the complexity becomes O(n).
Q: Which of the following graph traversals closely imitates level order traversal of a binary tree?
A. Depth First Search
B. Breadth First Search
C. Depth & Breadth First Search
D. Binary Search
Solution: Both level order tree traversal and breadth first graph traversal follow the principle that visit your neighbors first and then move on to further nodes.
Q: In a binary search tree, which of the following traversals would print the numbers in the ascending order?
A. Level-order traversal
B. Pre-order traversal
C. Post-order traversal
D. In-order traversal
Solution: In a binary search tree, a node’s left child is always lesser than the node and right child is greater than the node, hence an in-order traversal would print them in a non decreasing fashion.

You Have Score    /6